Incorporating Side Information in Tensor Completion
نویسندگان
چکیده
Matrix and tensor completion techniques have proven useful in many applications such as recommender systems, image/video restoration, and web search. We explore the idea of using external information in completing missing values in tensors. In this work, we present a framework that employs side information as kernel matrices for tensor factorization. We apply our framework to problems of recommender systems and video restoration and show that our framework effectively deals with the cold-start problem.
منابع مشابه
Inductive Framework for Multi-Aspect Streaming Tensor Completion with Side Information
Low-rank tensor completion is a well-studied problem and has applications in various fields. However, in many real-world applications the data is dynamic, i.e., the tensor grows as new data arrives. Besides the tensor, in many real-world scenarios, side information is also available in the form of matrices which also grow. Existing work on dynamic tensor completion do not incorporate side infor...
متن کاملNeuron Mathematical Model Representation of Neural Tensor Network for RDF Knowledge Base Completion
In this paper, a state-of-the-art neuron mathematical model of neural tensor network (NTN) is proposed to RDF knowledge base completion problem. One of the difficulties with the parameter of the network is that representation of its neuron mathematical model is not possible. For this reason, a new representation of this network is suggested that solves this difficulty. In the representation, th...
متن کاملRiemannian Tensor Completion with Side Information
Riemannian optimization methods have shown to be both fast and accurate in recovering a large-scale tensor from its incomplete observation. However, in almost all recent Riemannian tensor completion methods, only low rank constraint is considered. Another important fact, side information or features, remains far from exploiting within the Riemannian optimization framework. In this paper, we exp...
متن کاملTensor Completion with Side Information: A Riemannian Manifold Approach
By restricting the iterate on a nonlinear manifold, the recently proposed Riemannian optimization methods prove to be both efficient and effective in low rank tensor completion problems. However, existing methods fail to exploit the easily accessible side information, due to their format mismatch. Consequently, there is still room for improvement. To fill the gap, in this paper, a novel Riemann...
متن کاملDERIVATIONS OF TENSOR PRODUCT OF SIMPLE C*-ALGEBRAS
In this paper we study the properties of derivations of A B, where A and B are simple separable C*-algebras, and A B is the C*-completion of A B with respect to a C*-norm Yon A B and we will characterize the derivations of A B in terms of the derivations of A and B
متن کامل